A maximal domain for strategy-proof and no-vetoer rules in the multi-object choice model

نویسندگان

  • Kentaro Hatsumi
  • Dolors Berga
  • Shigehiro Serizawa
چکیده

Following Barberà, Sonnenschein, and Zhou (1991, Econometrica 59, 595-609), we study rules (or social choice functions) through which agents select a subset from a set of objects. We investigate domains on which there exist nontrivial strategy-proof rules. We establish that the set of separable preferences is a maximal domain for the existence of rules satisfying strategyproofness and no-vetoer.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximal Domain for Strategy-Proof Rules with One Public Good

In the context of the provision of one pure public good, we study how large a preference domain can be to allow for the existence of strategy-proof rules satisfying the no vetoer condition. This question is qualified by the additional requirement that a domain should include ``a minimally rich domain.'' We first characterize generalized median voter schemes as the unique class of strategy-proof...

متن کامل

Maximal domain for strategy-proof probabilistic rules in economies with one public good

We consider the problem of choosing a level of provision of public good on an interval of the real line among a group of agents. A probabilistic rule chooses a probability distribution over the interval to each preference profile. We investigate strategy-proof probabilistic rules in the case where distributions are compared based on stochastic dominance relation. First, on a “minimally rich dom...

متن کامل

A characterization of strategy-proof voting rules for separable weak orderings

We consider the problem of choosing a subset of a finite set of indivisible objects (public projects, facilities, laws, etc.) studied by Barberà, Sonnenschein, and Zhou (1991). Here we assume that agents’ preferences are separable weak orderings. Given such a preference, objects are partitioned into three types, “goods”, “bads”, and “nulls”. We focus on “voting rules”, which rely only on this p...

متن کامل

Maximal Domains for Strategy-proof or Maskin monotonic Choice Rules

Domains of individual preferences for which the well-known impossibility Theorems of Gibbard-Satterthwaite and Muller-Satterthwaite do not hold are studied. First, we introduce necessary and sufficient conditions for a domain to admit non-dictatorial, Pareto efficient and either strategy-proof or Maskin monotonic social choice rules. Next, to comprehend the limitations the two Theorems imply fo...

متن کامل

A New Nonlinear Multi-objective Redundancy Allocation Model with the Choice of Redundancy Strategy Solved by the Compromise Programming Approach

One of the primary concerns in any system design problem is to prepare a highly reliable system with minimum cost. One way to increase the reliability of systems is to use redundancy in different forms such as active or standby. In this paper, a new nonlinear multi- objective integer programming model with the choice of redundancy strategy and component type is developed where standby strategy ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Int. J. Game Theory

دوره 43  شماره 

صفحات  -

تاریخ انتشار 2014